Chaotic key generators for data security
نویسندگان
چکیده
منابع مشابه
Ramdomness quality of CI chaotic generators. Application to Internet security
Due to the rapid development of the Internet in recent years, the need to find new tools to reinforce trust and security through the Internet has became a major concern. The discovery of new pseudo-random number generators with a strong level of security is thus becoming a hot topic, because numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators...
متن کاملSecurity Frameworks for Pseudorandom Number Generators
In the cryptographic system a pseudorandom number generator is one of the basic primitives. We survey theoretically secure pseudorandom bit generators which are provably secure under certain reasonable number theoretic assumptions and some practical pseudorandom number generators based on assumptions about symmetric crypto-primitives. Recently, there was a noticeable result for the concrete sec...
متن کاملA cryptographic key generation scheme for multilevel data security
In 1982, and Taylor proposed an elegant solution to rhe partially ordered multilevel key distribution problem, using a cryptographic approach. Since then, continuing research has been conducred to try to realize and simplify their scheme. Generally speaking, there are two problems associated with their scheme. First, a large value associated with each security class needs to be made public. Sec...
متن کاملRe-otp Key Management Mechanism for the Cloud Data Security
Cloud storage is one of the most popular services techniques in cloud computing environment. A crucial problem to be addressed in the cloud storage system concerns the security mechanism of protecting the private data and sharing data with other users. Cloud storage services are inherently insecure as the management technique of the data in the cloud storage is controlled by third parties beyon...
متن کاملQuantifiers for randomness of chaotic pseudo-random number generators.
We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we fee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/1110/1/012013